Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata
نویسندگان
چکیده
The idea of using p-adic numbers in Turing machines and finite automata to describe random branching of the process of computation was recently introduced. In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automata are observed.
منابع مشابه
Path-Bounded One-Way Multihead Finite Automata
For each positive integer r ≥ 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of pathbounded one-way (simple) multihead nondeterministic finite automata. It is shown that for each k ≥ 2 and r ≥ 1, there is a language accepted by an (r+1) path-bounded one-way nondeterministic k head f...
متن کاملConnections among Space-bounded and Multihead Probabilistic Automata
We show that the heads of multihead unbounded-error or bounded-error or one-sided-error probabilistic nite automata are equivalent alternatives to the storage tapes of the corresponding probabilistic Turing machines (Theorem 1). These results parallel the classic ones concerning deterministic and nondeterministic automata. Several important properties of logarithmic-space (nondeterministic and ...
متن کاملOn Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all head...
متن کاملExperiments in Complexity of Probabilistic and Ultrametric Automata
We try to compare the complexity of deterministic, nondeterministic, probabilistic and ultrametric finite automata for the same language. We do not claim to have final upper and lower bounds. Rather these results can be considered as experiments to find advantages of one type of automata versus another type.
متن کاملState Complexity Advantages of Ultrametric Automata
Ultrametric automata have properties similar to the properties of probabilistic automata but the descriptional power of these types of automata can differ very much. In this paper, we compare ultrametric automata with deterministic, nondeterministic, probabilistic and alternating automata with various state complexities. We also show that two-way ultrametric automata can have a smaller state co...
متن کامل